Positive Polynomials and Sequential Closures of Quadratic Modules

نویسنده

  • TIM NETZER
چکیده

Let S = {x ∈ Rn | f1(x) ≥ 0, . . . , fs(x) ≥ 0} be a basic closed semi-algebraic set in Rn and let PO(f1, . . . , fs) be the corresponding preordering in R[X1, . . . , Xn]. We examine for which polynomials f there exist identities f + εq ∈ PO(f1, . . . , fs) for all ε > 0. These are precisely the elements of the sequential closure of PO(f1, . . . , fs) with respect to the finest locally convex topology. We solve the open problem from Kuhlmann, Marshall, and Schwartz (2002, 2005), whether this equals the double dual cone PO(f1, . . . , fs) ∨∨, by providing a counterexample. We then prove a theorem that allows us to obtain identities for polynomials as above, by looking at a family of fibrepreorderings, constructed from bounded polynomials. These fibre-preorderings are easier to deal with than the original preordering in general. For a large class of examples we are thus able to show that either every polynomial f that is nonnegative on S admits such representations, or at least the polynomials from PO(f1, . . . , fs)∨∨ do. The results also hold in the more general setup of arbitrary commutative algebras and quadratic modules instead of preorderings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of Quadratic Modules

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly in [PS], is a very useful property. It often implies that the quadratic module is closed; furthermore it helps settling the Moment Problem, solves the Membership Pro...

متن کامل

Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints

{(f1(x), . . . , fm(x)) : x ∈ T } for quadratic polynomials f0, . . . , fm and a subset T of R . This paper studies semidefinite representation of the convex hull conv(V ) or its closure, i.e., describing conv(V ) by projections of spectrahedra (defined by linear matrix inequalities). When T is defined by a single quadratic constraint, we prove that conv(V ) is equal to the first order moment t...

متن کامل

A Cyclage Poset Structure for Littlewood-Richardson Tableaux

A graded poset structure is defined for the sets of LittlewoodRichardson (LR) tableaux that count the multiplicity of an irreducible gl(n)module in the tensor product of irreducible gl(n)-modules corresponding to rectangular partitions. This poset generalizes the cyclage poset on columnstrict tableaux defined by Lascoux and Schützenberger, and its grading function generalizes the charge statist...

متن کامل

A TRUST-REGION SEQUENTIAL QUADRATIC PROGRAMMING WITH NEW SIMPLE FILTER AS AN EFFICIENT AND ROBUST FIRST-ORDER RELIABILITY METHOD

The real-world applications addressing the nonlinear functions of multiple variables could be implicitly assessed through structural reliability analysis. This study establishes an efficient algorithm for resolving highly nonlinear structural reliability problems. To this end, first a numerical nonlinear optimization algorithm with a new simple filter is defined to locate and estimate the most ...

متن کامل

An Iterative method for Solving the Container Crane Constrained Optimal Control Problem Using Chebyshev Polynomials

Abstract— In this paper, a computational method for solving constrained nonlinear optimal control problems is presented with an application to the container crane. The method is based on Banks' et al. iterative approach, in which the nonlinear system state equations are replaced by a sequence of time-varying linear systems. Therefore, The constrained nonlinear optimal control problem can be con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009